Dyck tilings, increasing trees, descents, and inversions
نویسندگان
چکیده
منابع مشابه
Dyck tilings , linear extensions , descents , and inversions ( extended abstract )
Dyck tilings were introduced by Kenyon and Wilson in their study of double-dimer pairings. They are certain kinds of tilings of skew Young diagrams with ribbon tiles shaped like Dyck paths. We give two bijections between “cover-inclusive” Dyck tilings and linear extensions of tree posets. The first bijection maps the statistic (area + tiles)/2 to inversions of the linear extension, and the seco...
متن کاملVariations on Descents and Inversions in Permutations
We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation σ = σ1σ2 · · · σn defined as the set of indices i such that either i is odd and σi > σi+1, or i is even and σi < σi+1. We show that this statistic is equidistributed with the odd 3-factor set statistic on permutations σ̃ ...
متن کاملGeneralized Dyck tilings (Extended Abstract)
Recently, Kenyon and Wilson introduced Dyck tilings, which are certain tilings of the region between two Dyck paths. The enumeration of Dyck tilings is related with hook formulas for forests and the combinatorics of Hermite polynomials. The first goal of this work is to give an alternative point of view on Dyck tilings by making use of the weak order and the Bruhat order on permutations. Then w...
متن کاملDescents in Noncrossing Trees
The generating function for descents in noncrossing trees is found. A bijection shows combinatorially why the descent generating function with descents set equal to 2 is the generating function for connected noncrossing graphs.
متن کاملNormal Approximations for Descents and Inversions of Permutations of Multisets
Normal approximations for descents and inversions of permutations of the set {1, 2, . . . , n} are well known. We consider the number of inversions of a permutation π(1), π(2), . . . , π(n) of a multiset with n elements, which is the number of pairs (i, j) with 1 ≤ i < j ≤ n and π(i) > π(j). The number of descents is the number of i in the range 1 ≤ i < n such that π(i) > π(i + 1). We prove tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2014
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2013.09.008